// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		int a,b;
		unordered_map<int,int> m;
		vector<unordered_map<int,int>> v(n+1);
		for(int i=1;i<n;i++)
		{
			cin>>a>>b;
			m[a]++;
			v[a][b]=1;
			m[b]++;
			v[b][a]=1;
		}
		int mx=0;
		
		vector<int> in;
		for(int i=1;i<=n;i++)
		{
			if(m[i]>mx)
			{
				mx=m[i];
				in.clear();
				in.push_back(i);
			}
			else if(m[i]==mx)in.push_back(i);
		}
		for(int i=1;i<=n;i++)
		{
			if(m[i]!=mx)
			{
				cout<<mx-1<<" "<<i;
				return 0;
			}
		}
		cout<<mx<<" "<<1;
	}
	return 0;
}
